Segments in a planar nearring
نویسندگان
چکیده
منابع مشابه
On a planar matching in line segments endpoints visibility graph
We show that the segment endpoint visibility graph of any finite set of 2n line segments contains a planar matching that does not use any segment edge, if the line segments in our set are convexly independent.
متن کاملMeasuring linearity of open planar curve segments
In this paper we define a new linearity measure for open planar curve segments. We start with the integral of the squared distances between all the pairs of points belonging to the measured curve segment, and show that, for curves of a fixed length, such an integral reaches its maximum for straight line segments. We exploit this nice property to define a new linearity measure for open curve seg...
متن کاملOn nilpotent elements in a nearring of polynomials
For a ring R, R[x] is a left nearring under addition and substitution, and we denote it by (R[x], +, ◦). In this note, we show that if nil(R) is a locally nilpotent ideal of R, then nil(R[x], +, ◦) = nil(R)0[x], where nil(R) is the set of nilpotent elements of R and nil(R)0[x] is the 0-symmetric left nearring of polynomials with coefficients in nil(R). As a corollary, if R is a 2-primal ring, t...
متن کاملPlanar Segments Based Three-dimensional Robotic Mapping in Outdoor Environments
This dissertation focuses on the problem of three-dimensional (3D) outdoor robotic mapping. Laser scanners are chosen as the primary sensors and a novel approach for scan registration based on planar segments is developed. Unlike most existing approaches, it does not require an a-priori pose estimation from other sensors such as odometers and inertial measurement units (IMUs). Instead, the tran...
متن کاملDrawings of planar graphs with few slopes and segments
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 52n segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane dr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00393-9